Hill-Climbing search and diversification within an evolutionary approach to protein structure prediction
نویسندگان
چکیده
منابع مشابه
Hill-climbing Search in Evolutionary Models for Protein Folding Simulations
Evolutionary algorithms and hill-climbing search models are investigated to address the protein structure prediction problem. This is a well-known NP-hard problem representing one of the most important and challenging problems in computational biology. The pull move operation is engaged as the main local search operator in several approaches to protein structure prediction. The considered appro...
متن کاملIncremental Hill-Climbing Search Applied to Bayesian Network Structure Learning
We propose two general heuristics to transform a batch Hillclimbing search into an incremental one. Then, we apply our heuristics to two Bayesian network structure learning algorithms and experimentally see that our incremental approach saves a significant amount of computing time while it yields similar networks than the batch algorithms.
متن کاملComparison of Genetic and Hill Climbing Algorithms to Improve an Artificial Neural Networks Model for Water Consumption Prediction
No unique method has been so far specified for determining the number of neurons in hidden layers of Multi-Layer Perceptron (MLP) neural networks used for prediction. The present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. The data used in the present research for prediction are consumption data of water...
متن کاملAn Evolutionary Hill Climbing Algorithm for Dynamic Optimisation Problems
1 Introduction In contrast to stationary problems where the problem parameters are static, dynamic optimisation problems (DOPs) present a challenging research area to the community [1]. This is mainly because, changes can occur any time during the optimisation course. Hence, when such a change happens (for example a change in the fitness landscape), the previous local optimal solution is no lon...
متن کاملAn Empirical Comparison of Hill-Climbing and Exhaustive Search in Inductive Rule Learning An Empirical Comparison of Hill-Climbing and Exhaustive Search in Inductive Rule Learning
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluate the spectrum of different search strategies to see whether separate-and-conquer rule learning algorithms are able to gain performance in terms of predictive accuracy or theory size by using more powerful search strat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BioData Mining
سال: 2011
ISSN: 1756-0381
DOI: 10.1186/1756-0381-4-23